Submatrix maximum queries in Monge matrices: an implementation
نویسنده
چکیده
We propose an implementation of the data structure presented by Kaplan, Mozes, Nussbaum, and Sharir in [KMNS12] for submatrix maximum queries in Monge matrices. The implementation shows that the average running time of the algorithm is similar to the proved worse case running time: O(log n). We also propose a new efficient and low-memory consuming procedure to generate random Monge matrices.
منابع مشابه
Improved Submatrix Maximum Queries in Monge Matrices
We present efficient data structures for submatrix maximum queries in Monge matrices and Monge partial matrices. For n× n Monge matrices, we give a data structure that requires O(n) space and answers submatrix maximum queries in O(logn) time. The best previous data structure [Kaplan et al., SODA‘12] required O(n logn) space and O(log n) query time. We also give an alternative data structure wit...
متن کاملSubmatrix Maximum Queries in Monge Matrices Are Equivalent to Predecessor Search
We present an optimal data structure for submatrix maximum queries in n×nMonge matrices. Our result is a two-way reduction showing that the problem is equivalent to the classical predecessor problem in a universe of polynomial size. This gives a data structure of O(n) space that answers submatrix maximum queries in O(log logn) time, as well as a matching lower bound, showing that O(log log n) q...
متن کاملSubmatrix maximum queries in Monge matrices and Monge partial matrices, and their applications
We describe a data structure for submatrix maximum queries in Monge matrices or Monge partial matrices, where a query specifies a contiguous submatrix of the given matrix, and its output is the maximum element of that submatrix. Our data structure for an n × n Monge matrix takes O(n log n) space, O(n log n) preprocessing time, and can answer queries in O(log n) time. For a Monge partial matrix ...
متن کاملAdvanced Topics in Algorithms
[1] Alok Aggarwal, Maria M. Klawe, Shlomo Moran, Peter W. Shor, and Robert E. Wilber. Geometric applications of a matrix-searching algorithm. Algorithmica, 2:195–208, 1987. [2] M.T. de Berg, O. Schwarzkopf, M.J. van Kreveld, and M. Overmars. Computational Geometry: Algorithms and Applications. Springer-Verlag, 2000. [3] Haim Kaplan, Shay Mozes, Yahav Nussbaum, and Micha Sharir. Submatrix maximu...
متن کاملAn iterative method for the Hermitian-generalized Hamiltonian solutions to the inverse problem AX=B with a submatrix constraint
In this paper, an iterative method is proposed for solving the matrix inverse problem $AX=B$ for Hermitian-generalized Hamiltonian matrices with a submatrix constraint. By this iterative method, for any initial matrix $A_0$, a solution $A^*$ can be obtained in finite iteration steps in the absence of roundoff errors, and the solution with least norm can be obtained by choosing a special kind of...
متن کامل